Random real trees

We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between discrete Galton-Watson trees and continuous random trees. We then discuss the particular class of self-similar random real trees called stable trees, which generalize the CRT. We review several important results concerning stable trees, including their branching property, which is analogous to the well-known property of Galton-Watson trees, and the calculation of their fractal dimension. We then consider spatial trees, which combine the genealogical structure of a real tree with spatial displacements, and we explain their connections with superprocesses. In the last section, we deal with a particular conditioning problem for spatial trees, which is closely related to asymptotics for random planar quadrangulations.Comment: 25 page

Bessel processes, the Brownian snake and super-Brownian motion

We prove that, both for the Brownian snake and for super-Brownian motion in dimension one, the historical path corresponding to the minimal spatial position is a Bessel process of dimension -5. We also discuss a spine decomposition for the Brownian snake conditioned on the minimizing path.Comment: Submitted to the special volume of S\'eminaire de Probabilit\'es in memory of Marc Yo

Feller property and infinitesimal generator of the exploration process

We consider the exploration process associated to the continuous random tree (CRT) built using a Levy process with no negative jumps. This process has been studied by Duquesne, Le Gall and Le Jan. This measure-valued Markov process is a useful tool to study CRT as well as super-Brownian motion with general branching mechanism. In this paper we prove this process is Feller, and we compute its infinitesimal generator on exponential functionals and give the corresponding martingale

A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees

We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index $\theta \in (1,2]$, conditioned on having total progeny $n$, converges in the functional sense to the normalized excursion of the continuous-time height function of a strictly stable spectrally positive L\'evy process of index $\theta$. To this end, we generalize an idea of Le Gall which consists in using an absolute continuity relation between the conditional probability of having total progeny exactly $n$ and the conditional probability of having total progeny at least $n$. This new method is robust and can be adapted to establish invariance theorems for Galton-Watson trees having $n$ vertices whose degrees are prescribed to belong to a fixed subset of the positive integers.Comment: 16 pages, 2 figures. Published versio

Work-rate of substitutes in elite soccer: A preliminary study

The aim of this study was to investigate the work-rate of substitutes in professional soccer. A computerised player tracking system was used to assess the work-rates of second-half substitutes (11 midfielders and 14 forwards) in a French Ligue 1 club. Total distance, distance covered in five categories of movement intensity and recovery time between high-intensity efforts were evaluated. First- and second-half work-rates of the replaced players were compared. The performance of substitutes was compared to that of the players they replaced, to team-mates in the same position who remained on the pitch after the substitution and in relation to their habitual performances when starting games. No differences in work-rate between first- and second-halves were observed in all players who were substituted. In the second-half, a non-significant trend was observed in midfield substitutes who covered greater distances than the player they replaced whereas no differences were observed in forwards. Midfield substitutes covered a greater overall distance and distance at high-intensities (p<0.01) and had a lower recovery time between high-intensity efforts (p<0.01) compared to other midfield team-mates who remained on the pitch. Forwards covered less distance (p<0.01) in their first 10-minutes as a substitute compared to their habitual work-rate profile in the opening 10-minutes when starting matches while this finding was not observed in midfielders. These findings suggest that compared to midfield substitutes, forward substitutes did not utilise their full physical potential. Further investigation is warranted into the reasons behind this finding in order to optimise the work-rate contributions of forward substitutes

The topological structure of scaling limits of large planar maps

We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least along a suitable subsequence, the metric space M(n) equipped with the graph distance rescaled by the factor n to the power -1/4 converges in distribution as n tends to infinity towards a limiting random compact metric space, in the sense of the Gromov-Hausdorff distance. We prove that the topology of the limiting space is uniquely determined independently of p, and that this space can be obtained as the quotient of the Continuum Random Tree for an equivalence relation which is defined from Brownian labels attached to the vertices. We also verify that the Hausdorff dimension of the limit is almost surely equal to 4.Comment: 45 pages Second version with minor modification

Quantum Algorithms for Matrix Products over Semirings

In this paper we construct quantum algorithms for matrix products over several algebraic structures called semirings, including the (max,min)-matrix product, the distance matrix product and the Boolean matrix product. In particular, we obtain the following results. We construct a quantum algorithm computing the product of two n x n matrices over the (max,min) semiring with time complexity O(n^{2.473}). In comparison, the best known classical algorithm for the same problem, by Duan and Pettie, has complexity O(n^{2.687}). As an application, we obtain a O(n^{2.473})-time quantum algorithm for computing the all-pairs bottleneck paths of a graph with n vertices, while classically the best upper bound for this task is O(n^{2.687}), again by Duan and Pettie. We construct a quantum algorithm computing the L most significant bits of each entry of the distance product of two n x n matrices in time O(2^{0.64L} n^{2.46}). In comparison, prior to the present work, the best known classical algorithm for the same problem, by Vassilevska and Williams and Yuster, had complexity O(2^{L}n^{2.69}). Our techniques lead to further improvements for classical algorithms as well, reducing the classical complexity to O(2^{0.96L}n^{2.69}), which gives a sublinear dependency on 2^L. The above two algorithms are the first quantum algorithms that perform better than the $\tilde O(n^{5/2})$-time straightforward quantum algorithm based on quantum search for matrix multiplication over these semirings. We also consider the Boolean semiring, and construct a quantum algorithm computing the product of two n x n Boolean matrices that outperforms the best known classical algorithms for sparse matrices. For instance, if the input matrices have O(n^{1.686...}) non-zero entries, then our algorithm has time complexity O(n^{2.277}), while the best classical algorithm has complexity O(n^{2.373}).Comment: 19 page

Information Loss in Coarse Graining of Polymer Configurations via Contact Matrices

Contact matrices provide a coarse grained description of the configuration omega of a linear chain (polymer or random walk) on Z^n: C_{ij}(omega)=1 when the distance between the position of the i-th and j-th step are less than or equal to some distance "a" and C_{ij}(omega)=0 otherwise. We consider models in which polymers of length N have weights corresponding to simple and self-avoiding random walks, SRW and SAW, with "a" the minimal permissible distance. We prove that to leading order in N, the number of matrices equals the number of walks for SRW, but not for SAW. The coarse grained Shannon entropies for SRW agree with the fine grained ones for n <= 2, but differs for n >= 3.Comment: 18 pages, 2 figures, latex2e Main change: the introduction is rewritten in a less formal way with the main results explained in simple term